Minimal Graphs in H × R and Their Projections
نویسنده
چکیده
June 29, 2007 There has been a recent resurgence of interest in the subject of minimal surfaces in product three-manifolds, for example H ×R [Ros02], [MR04], [MIR05], [NR02], [Dan06], [FM05], [HET05]. The purpose of this note is to describe a construction and some examples originating in the harmonic maps literature whose consequences for minimal surfaces seem to have escaped notice. We organize this note as follows. First we recall how harmonic maps to H (or a Riemannian complex) lead, via associated maps to real trees, to minimal surfaces in H × R. This occupies the first three sections and leads to a proposition describing minimal graphs in terms of harmonic maps to trees and their folds. In the next section, we apply the construction to some examples from the harmonic maps literature to create some minimal graphs whose shapes have not yet been explored much. We describe rapidly oscillating graphs, including one derived from a harmonic map to the Cayley graph of a free group. In terms of asymptotic behavior, we describe a non-trivial graph whose boundary values are constant except at a single point, and graphs which accumulate only over a Cantor set on S ∞. We relate Jenkins-Serrin constructions to trees of finite total valence in section five, and conclude in section six with a non-orientable example (over the product of a surface with RP) corresponding to a harmonic map to a tree which does not fold. The author is grateful to Bill Meeks and Matthias Weber for several stimulating and encouraging conversations.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملSome Applications of Strong Product
Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...
متن کامل